Diffusion centrality: A paradigm to maximize spread in social networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffusion centrality: A paradigm to maximize spread in social networks

We propose Diffusion Centrality (DC) in which semantic aspects of a social network are used to characterize vertices that are influential in diffusing a property p. In contrast to classical centrality measures, diffusion centrality of vertices varies with the property p, and depends on the diffusion model describing how p spreads. We show that DC applies to most known diffusion models including...

متن کامل

Centrality in Social Networks

Centrality is an important concept in the study of social networks, which in turn are important in studying organisational and team behaviour. For example, “central” individuals influence information flow and decisionmaking within a group. However, the relationship between mathematical measures of centrality on the one hand, and the real-world phenomenon of centrality on the other, is somewhat ...

متن کامل

A study on the influential neighbors to maximize information diffusion in online social networks

The problem of spreading information is a topic of considerable recent interest, but the traditional influence maximization problem is inadequate for a typical viral marketer who cannot access the entire network topology. To fix this flawed assumption that the marketer can control any arbitrary k nodes in a network, we have developed a decentralized version of the influential maximization probl...

متن کامل

Path Centrality: A New Centrality Measure in Social Networks

Processing large graphs is an emerging and increasingly important computation in a variety of application domains, from social networking to genomics and marketing. One of the important and computationally challenging structural graph metrics is node betweenness centrality, a measure of influence of a node in the graph. The best known algorithm for computing exact betweenness centrality runs in...

متن کامل

Spreader Selection by Community to Maximize Information Diffusion in Social Networks

Rumors or information can spread quickly and reach many users in social networks. Models for understanding, preventing or increasing the diffusion of information are of greatest interest to companies, governments, scientists, etc. In this paper, we propose an approach for maximizing the information diffusion by selecting the most important (central) users from communities. We also analyze the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2016

ISSN: 0004-3702

DOI: 10.1016/j.artint.2016.06.008